Distributed Mirror-Prox Optimization for Multi-Access Edge Computing

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reliable Distributed Authentication in Multi-Access Mobile Edge Computing

The fifth generation (5G) mobile telecommunication network is expected to support multi-access mobile edge computing (MEC), which intends to distribute computation tasks and services from the central cloud to the edge clouds. Towards ultraresponsive, ultra-reliable and ultra-low-latency MEC services, the current mobile network security architecture should enable more decentralized approach for ...

متن کامل

Memory and Communication Efficient Distributed Stochastic Optimization with Minibatch Prox

We present and analyze statistically optimal, communication and memory efficient distributed stochastic optimization algorithms with near-linear speedups (up to log-factors). This improves over prior work which includes methods with near-linear speedups but polynomial communication requirements (accelerated minibatch SGD) and communication efficient methods which do not exhibit any runtime spee...

متن کامل

Mirror Prox Algorithm for Multi-Term Composite Minimization and Alternating Directions

In the paper, we develop a composite version of Mirror Prox algorithm for solving convex-concave saddle point problems and monotone variational inequalities of special structure, allowing to cover saddle point/variational analogies of what is usually called “composite minimization” (minimizing a sum of an easy-to-handle nonsmooth and a general-type smooth convex functions “as if” there were no ...

متن کامل

Mirror Prox algorithm for multi-term composite minimization and semi-separable problems

In the paper, we develop a composite version of Mirror Prox algorithm for solving convexconcave saddle point problems and monotone variational inequalities of special structure, allowing to cover saddle point/variational analogies of what is usually called “composite minimization” (minimizing a sum of an easy-to-handle nonsmooth and a general-type smooth convex functions “as if” there were no n...

متن کامل

Mirror-Prox SCA Algorithm for Multicast Beamforming and Antenna Selection

This paper considers the (NP-)hard problem of joint multicast beamforming and antenna selection. Prior work has focused on using Semi-Definite relaxation (SDR) techniques in an attempt to obtain a high quality sub-optimal solution. However, SDR suffers from the drawback of having high computational complexity, as SDR lifts the problem to higher dimensional space, effectively squaring the number...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Communications

سال: 2020

ISSN: 0090-6778,1558-0857

DOI: 10.1109/tcomm.2020.2973566